
# # 求n的阶乘
# def jc(n):
#     if n == 1:
#         return 1
#     else:
#         return n * jc(n-1)
#
# print(jc(5))

# 求第n个斐波那契的数列的数
# def fbnq(n):
#     if n in (1, 2):
#         return 1
#     else:
#         return fbnq(n-1) + fbnq(n-2)

# 汉诺塔程序编写
# def hnt(n, a, b, c):
#     if n == 1:
#         print(a, '---->', c)
#     else:
#         hnt(n-1, a, c, b)
#         print(a, '--->', c)
#         hnt(n-1, b, a, c)
# hnt(3, "A", 'B', 'C')


